Sampling-based Path Planning on Configuration-Space Costmaps L´eonard Jaillet, Juan Cort´es and Thierry Sim´eon Abstract—This paper addresses path planning considering a cost function defined over the configuration

Source URL: homepages.laas.fr

• Search algorithms
• Mathematics
• Routing algorithms
• Information science
• Information retrieval
• Edsger W. Dijkstra
• Combinatorial optimization
• Robot navigation
• A* search algorithm
• Shortest path problem
• Motion planning
• Rapidly-exploring random tree

Metaheuristics for Transport and Logistics Andrea E. Rizzoli, IDSIA Luca Maria Gambardella, IDSIA Conference paper STRC 2002

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Metaheuristics
• Luca Maria Gambardella
• Search algorithms
• Ant colony optimization algorithms
• Dalle Molle Institute for Artificial Intelligence Research
• Genetic algorithm
• Combinatorial optimization
• Tabu search
• Artificial ants
• Travelling salesman problem

STARS: Static Relays for Multi-Robot Real-time Search and Monitoring Yuanteng Pei and Matt W. Mutka Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearo

Source URL: www.jeffpei.com

CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION Tofigh Naghibi, Sarah Hoffmann, Beat Pfister Speech Processing Group, Computer Engineering and Networks Lab., ETH Zurich, Switzerland {naghib

Source URL: www.tik.ee.ethz.ch

An algorithm for graph isomorphism and its application to KEGG Compound Search Nobuya Tanaka1 Susumu Goto

Source URL: www.jsbi.org

• Mathematics
• Computational complexity theory
• Systems biology
• Subgraph isomorphism problem
• KEGG
• Matching
• Algorithm

Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao Department of Computer Science, UC Santa Barbara, USA {xiaohanzhao, alessandra, bowlin,

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Networks
• Network analysis
• Edsger W. Dijkstra
• Centrality
• Small-world network
• Shortest path problem
• Graph
• Breadth-first search

Nonlinear global optimization relevant to discrete choice models estimation M. Bierlaire, EPFL, TRANSP-OR Laboratory M. Thémans, EPFL, TRANSP-OR Laboratory N. Zufferey, Université Laval, Facultés des sciences de l’a

Source URL: www.strc.ch

• Mathematical optimization
• Numerical analysis
• Applied mathematics
• Operations research
• Search algorithms
• Metaheuristics
• Travelling salesman problem
• Variable neighborhood search
• Global optimization
• Ant colony optimization algorithms
• Local search
• Genetic algorithm

Wonderful problem solvers. POM is pulling out all the stops in our search to help you produce the perfect product. That’s why we’ve developed our P O M Innovation Center, which is constantly hard at work: • Creatin

Source URL: www.pomindustrial.com

• Contract law
• POM Wonderful
• Implied warranty
• Warranty
• Pom
• Kind
• As is

Wavelet theory and its applications to images retrieval Aliaksandr Autayeu Retrieval problem

Source URL: autayeu.com

• Information science
• Information retrieval
• Image search
• Artificial intelligence
• Internet search engines
• Multimedia
• Artificial intelligence applications
• Data mining
• Content-based image retrieval
• Image retrieval
• Google Images
• RetrievalWare

1 PASS: A Parallel Activity Search System Andrea Pugliese, V.S. Subrahmanian, Christopher Thomas, and Cristian Molinaro Abstract—Given a set A of activities expressed via temporal stochastic automata, and a set O of o

Source URL: www.cs.umd.edu

• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming